System and methods for maintaining user privacy in applications providing products and/or services

ABSTRACT

Decentralization of application programs is a growing trend. It is known that user data communicated to different components of a transaction or application may be linked to derive a composite profile of users. A system and methods are presented that maintain user data privacy in decentralized networks, possibly containing multiple sensor devices. Applications to controlling smart devices and service portability across providers are shown.

CROSS-REFERENCE

This application claims the benefit of U.S. Provisional Application Ser. No. 62/371,403, filed Aug. 5, 2016, the contents of which are incorporated herein by reference in its entirety.

BACKGROUND

Service experiences abound on the Internet and the Web. New inventions such as block-chain based systems envision computer programs called smart contracts to provide services to smart devices such as autonomous cars. It is further envisioned that an overall service experience may be disaggregated into multiple components wherein more than one service provider may provide the individual components. Many smart devices, smart computer programs and service experiences also utilize data obtained from sensor devices located in user computing devices or physical environments wherein user devices are proximately located. Thus, service experiences entailing the use of autonomous cars may collect increasing amounts of user data. Most service experiences are also based on user provided information. Consumers have increasingly shown signs of being concerned with preserving user data privacy. A service provisioning system that preserves user data privacy in online networks with sensor devices collecting increasingly larger amounts of user data will thus be of great social value and commercial benefit.

SUMMARY

In accordance with one aspect of the subject matter described herein, a system and method is provided for facilitating delivery of a product and/or service to a user. In accordance with the method a first executable computer code is caused to be inserted into a computing environment in which a user session is established. The first executable computer code is associated with an entity that provides the product and/or service. A user session is established in the computing environment. In response to the first executable computer code being inserted into the user session, a first virtual machine is created in the user session. The first executable computer code is executed in the first virtual machine, wherein executing the first executable computer code includes obtaining, over a communications network and from a user computing device of the user, a first proper subset of all information needed from the user computing device that is required to fulfill delivery of the product and/or service. The first proper subset of all the information is less than a complete set of all the information needed from the user computing device that is required to fulfill delivery of the product and/or service. The first proper subset of the information is processed by the first executable computer code. The first executable computer code produces first output data. The first virtual machine is terminated upon completion of executing the first executable computer code. A second executable computer code is obtained based at least on a first portion of the first output data produced by the first executable computer code. The second executable computer code is caused to be inserted into the user session established in the computing environment. In response to the second executable computer code being inserted into the user session, a second virtual machine is created in the user session. The second executable computer code is executed in the second virtual machine, wherein executing the second executable computer code includes obtaining, over the communications network and from the user computing device, a second proper subset of all the information needed from the user computing device that is required to fulfill delivery of the product and/or service. The second proper subset of all the information is less than the complete set of all the information needed from the user computing device that is required to fulfill delivery of the product and/or service and includes information not included in the first proper subset of the information. The second proper subset of the information is processed by the second executable computer code. The second executable computer code produces second output data. The second virtual machine terminates upon completion of executing the second executable computer code. Based at least in part on the second output data produced by the second executable computer code, the product and/or service is caused to be delivered to the user of the user computing device.

In accordance with one aspect of the subject matter described herein, a system and method is provided for performing a transaction over a communications network. In accordance with the method, responsive to a user request received over the communications network, a user session is established in a computing environment. A plurality of executable computer codes is executed in the computing environment that each perform a portion of the transaction, wherein executing each of the executable computer codes includes obtaining over a communications network and from a user computing device of the user, a different proper subset of all information needed from the user computing device that is required to complete the transaction. Each of the proper subsets of all the information is less than a complete set of all the information needed from the user computing device that is required to complete the transaction. Each of the executable computer codes processes the respective subset of information that it obtains. Information is only exchanged between and among the plurality of executable computer codes during execution of each of the executable computer codes by obtaining encrypted output information that was previously output from one of the executable computer codes. The encrypted output information is encrypted such that one or more decryption keys are required from the user in order to decrypt the output information. After completing execution of a final one of the executable computer codes necessary to complete the transaction, the user session is terminated so that each of the subsets of information no longer exist in the computing environment.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 shows elements of a decentralized transaction in an online purchase of a book.

FIG. 2 shows exemplary linking information implicit in a decentralized transaction.

FIG. 3 shows one example of the overall operating environment of the present invention.

FIG. 4A shows a conventional DH algorithm.

FIG. 4B shows an illustrative extension of DH algorithm.

FIGS. 5A, 5B and 5C illustrate the operation of the extension to the DH algorithm.

FIG. 6 shows an example of the contents that may be included in the directory.

FIG. 7 shows the working of the database processor with respect to a single session containing a single VM.

FIG. 8A shows exemplary computer programs.

FIG. 8B shows examples of computer program instructions and their semantics.

FIG. 9 shows an exemplary rewriting of the programs of FIG. 8A implicit in the operation of the database program.

FIG. 10 shows an exemplary system architecture for an illustrative embodiment.

FIGS. 11A, 11B and 11C depict details of the operation of an illustrative embodiment.

FIG. 12 shows a first illustrative commercial embodiment.

FIGS. 13A and 13B show a second illustrative commercial embodiment.

FIG. 14 shows exemplary service portability from one service provider to another.

DETAILED DESCRIPTION Motivation

Web services and the business model of the web are critically dependent on data gathered from and about consumers. Customized, personalized services and user experiences are crafted using data gathered from consumers and, in some cases, acquired from third party providers. Advertisements, marketing of content and services, recommendations, etc., are all based in part on user data and the results of its analysis. As the web evolves to support sensors and sensor-based devices such as smart cars, smart household appliances, etc., the gathering of user data is expected to increase.

Concomitantly, the user community is becoming aware of the fact that web enterprises store large amounts of their personal data and this awareness is leading many users to question the storing and use of user data. Concerns regarding privacy of data are on the rise. Outages and breaches of data at enterprises and hacking of enterprise software systems exacerbate such concerns.

In some embodiments the present invention describes system and methods by which an open decentralized marketplace may be constructed that offers several features that address these concerns. The term “open” refers to the possibility of having multiple service providers interacting without proprietary interfaces. The term “decentralized” refers to the notion that no single entity is in control and that various entities may combine to offer an overall service.

The invention described herein allows users to reveal selected elements of personal data to one or more service providers and obtain services. However, such provisioning of user data is controlled by the user who reveals his data to a computational entity that, by design, cannot retain the provisioned data or its memory. That is, the computational construct receives the user data, executes itself in an environment that is “sterile” in a sense described later, and then terminates itself

The one or more service providers may be organized as individual entities performing distinct functions that taken together constitute the product and/or service provided to the user. As an example of such an arrangement, consider an online book seller, payment processor and shipper that enter into a business arrangement by which a user may purchase a book from the seller, pay for it using a payment processor and receive it in a shipment managed by the shipper.

In the present invention, the book seller, payment processor and shipper are represented by executable computer code such as computer programs or apps that are specially configured (described in more detail later) and which are received, e.g., downloaded, by user devices. The user devices then inject the programs into a (distributed) computing environment containing a database processor. For purposes of illustration the individual executable computer codes will be referred to as computer programs, but more generally any suitable type of computer code may be employed that is configured in the manner described herein.

It should be noted that the data processor performs various actions that are not performed by conventional database processors. In particular, the database processor is configured to carry out three actions.

First, when connected to a user computing device that is seeking service, the database processor creates a session between the user computing device and itself. In some embodiments the communication channel used to exchange data between the user device and the database processor is preferably secured. One example of such a secure protocol that may be employed is discussed below.

Second, the database processor produces one or more virtual machines (VMs) that are provisioned with one of the aforementioned computer programs. The VMs may be produced sequentially or in parallel. Each VM executes one of the provisioned computer programs, each of which may produce output that is restricted as explained later. The VMs are configured to terminate themselves at the conclusion of the execution of the provisioned computer program.

Finally, the database processor terminates the session established between the user device and the database processor. This action may occur if, e.g., the database processor determines that the service request from the user device has been satisfied, or if the database processor receives a special command from the user device. The database processor clears any data outputted by the various VMs during the session. We may say that the session has been “cleared” or that we “tear-down” the session to stand for the operation of clearing the outputted data.

Thus, while the term “database processor” is known in prior art, it will be seen that its use in the present invention requires several new innovations and features, e.g., the creation and management of virtual machines, etc.

Illustrative Example (Purchasing Books Online)

We begin by considering an illustrative example of a web service provider such as an online bookstore. Currently several such establishments exist and they typically allow consumers to browse and select books and purchase titles through an in-house payment system. Purchased books may then be delivered by another in-house shipping operation. The online bookstore, thus, provides a “single stop” service.

The information that consumers are required to provide to such service providers may comprise user name, billing address, shipping address, telephone number, credit card information, email address, and user ID/password. (The service provider may also acquire additional information about consumers and their actions from third-party providers who gather information about users from cookies and other mechanisms.)

A consumer may be entitled to ask if all such information needs to be provided. If we assume the enterprise to be decentralized into separate entities such as Seller, Payment and Shipper entities then a consumer may be able to provide only proper subsets of information to the individual entities. For example, only his shipping address may be provided to the Shipper who has no need for any other information. Similarly, the Seller needs only the title being purchased if the payment for the title can be authenticated. The Payment processor needs only to authenticate the consumer and the funds.

Thus, by decentralizing the online service provider into separate entities, a consumer may be able to provide subsets of his information, as needed, to the various entities.

However, the consumer is now burdened with performing actions to manage “linking information” that binds the individual actions (or sub-transactions) into a single transaction. In other words, the individual sub-transactions may comprise selecting a book, making a payment and arranging a shipment. The linking information tells the Payment processor which Seller and title is being bought. Another piece of linking information tells the Shipper what title and where to pick up the shipment. The Seller needs to be told by the Payment processor which title is being paid for and on behalf of whom. Etc.

Since consumers do not want to be burdened by such actions, online systems allow state information to be passed between entities, e.g., Seller, Payment and Shipper. The state information contains contextual information that allows individual sub-transactions to be linked together into a single transaction. In prior art, terms such as tags or tokens have been used to describe computational constructs that contain shared state information.

Automated sharing of tokens and tags between business entities allows consumers to be freed from managing the “linking information” associated with the individual sub-transactions. However, on the downside, it is possible for a third-party to use the shared token/tags to re-construct the entire transaction, resulting in the gathering of user information into a user profile. For example, user information contained in browser “cookies” is routinely used to construct integrated profiles of users.

A related problem is that entities receiving and using shared tokens/tags must trust these instruments. Malicious users may insert spurious or malicious information into a token or a tag, e.g., re-direct funds or shipments to a malicious address.

It would, therefore, appear that decentralizing a service provider into separate entities still allows third-party enterprises to aggregate user information. It also introduces additional security and trust concerns regarding shared information.

Thus, it would be desirable to have an invention that provides a system and methods providing the following features.

Online services are provided by a group of computer programs organized as an open decentralized marketplace, i.e., a distributed computing environment or network of computer programs. That is, business entities are represented by computer programs that are inter-connected by an open networking environment.

User information is partitioned into two classes (i) explicit information, and (ii) latent information. Explicit information is provided to a computer program by the consumer so that it may perform its functions, e.g., shipping address provided by a consumer as it is needed by a program so that the consumer may receive goods at the indicated address. Latent information, e.g., location information, is provided by sensor devices associated with a user device.

It is not possible to link information outputted by the computer programs to obtain an integrated user profile.

The user may experience an integrated experience despite the above requirements.

An exemplary online transaction by which a consumer purchases a book and has it delivered to his address comprises the following. (Names beginning with a capital letter in the descriptions below denote computer programs.)

The Seller requires that the customer must be located within a pre-determined geographical area at the time of ordering, e.g., state of New York. (One reason for such a restriction may be local tax laws.)

The customer must arrange payment from the online Payment Processor. Seller needs proof of payment, i.e., payment amount and title.

Payment Processor needs to authenticate the user.

Purchased titles will be made available by Seller to be picked up by the Shipper. Shipper needs a token (provided by the consumer in one embodiment) information to pick up shipment and the delivery address. Shipper needs verification that Seller has authorized the title to be picked up.

We assume consumers interact with the computer programs in the computing environment using devices, e.g., smart phones, hereinafter referred to as user computing devices. Thus, a consumer may also be thought of as being represented by a computer program running on his computing device. A consumer, John, wishing to purchase a title from Seller, utilizing prior art, may undertake the following sequence of steps (cf. FIG. 1).

In step 1, John visits Payment Processor and establishes an account by providing information, as needed, to the Payment Processor. (Note: This action may be considered as being a part of an initial setup phase.) John is issued an account number for future use.

In step 2, John visits a Location Certifying Authority (LCA) and provides data from his GPS-enabled mobile device. LCA issues a token (Token-1) to John indicative of his location.

In step 3, John visits Seller and provides Token-1 to the Seller who verifies that the token is valid and that John's location satisfies Seller's constraint. John selects a title to be purchased. Seller issues him a token (Token-2).

In step 4, John provides Token-2 to the Payment Processor who verifies that the token is valid, authenticates John, and provides a token (Token-3) to John indicating that he has processed a payment as per information contained in Token-2.

In step 5, John re-visits the Seller and presents Token-3. Seller verifies that Token-3 is valid and that he has received the payment for the selected title. As a by-product of the verification, Seller receives information about the title being purchased, payment amount and some information about the purchaser, e.g., John's name or customer number. Seller issues a new token to John (Token-4).

In step 6, John visits Shipper and presents Token-4. Shipper verifies that the token is valid and that the shipment is ready and obtains a delivery address as a by-productof the verification process (as explained later).

In step 7, using Token-4, Shipper picks up the shipment from Seller and delivers it to the delivery address provided in step 6.

(We have assumed a certain distributed arrangement of service providing entities above for illustrative purposes; in practice, one or more of the service providing entities may be combined or further partitioned without limiting the present invention.)

The following observations are noteworthy about the above process.

The user must perform six of the seven steps (including the initial setup step).

The total amount of information the user provides is the same whether the consumer is provided service by a single provider or a collection of providers.

It should also be observed that the computer programs may verify information by using the various tokens. First, the Seller can verify that the purchaser satisfies the location constraint using token-1. Next, the Seller can verify that a purchaser has paid for a purchase (using token-3) and that the purchaser satisfies the location constraint (token-1). As a further example of the linking phenomenon, note that the Shipper can verify that a shipment is ready, that the shipment has been paid for, and that the purchaser satisfies the location constraint. The arrows marked A, B, C and D in FIG. 2 depict the linking phenomenon.

In other words, an entity that has access to all the tokens may effectively re-construct the entire transaction and, thus, derive an integrated user profile.

It is worthwhile here to note that advanced decentralized and open systems and environments such as Bitcoin and ledger-based block-chain systems have reported that certain entities have been able to link information from computer programs, e.g., smart contracts or transactions, and create composite user profiles.

Thus, to protect the user's private data, it would be desirable to have a solution that prevents a third-party to construct such integrated/composite user profiles using customer data, e.g., by putting together the linking information A, B, C and D in FIG. 2. This is the goal of the present invention.

In the following descriptions, we note two cases.

1. User data may be obtained by computer programs from sensors located within a user device, e.g., GPS location data from a smartphone, or from sensor devices external to the user device, e.g., a fitness bracelet associated with a user's smartphone.

2. A consumer may provide information by user input to a service provider, e.g., by entering a shipping address, or the user's device may provide user data via one or more applications running on the user device.

Some embodiments of the subject matter described herein address both the above cases.

General System and Methods of Invention

FIG. 3 depicts a high level schematic diagram of one example of an operating environment in which the subject matter described herein may be implemented. Illustrative user computing devices 100 and 150 may be associated with internal sensors, e.g., sensor 51, or external sensors, e.g., sensor 52. The external sensors may communicate with its respective user device over a communication link such as Bluetooth, Wi-Fi, etc. Examples of user computing devices include, without limitation, mobile communication devices (e.g., cellular phones, smart phones), personal computers, laptops, tablet computers, smart watches, wearable computers (e.g., fitness bands), personal digital assistants (PDAs), wearable medical devices such as smart bandages and the like.

User computing devices may be connected, using wireless and/or wired networking links, to a distributed computing environment 200 that contains a database processor 203, i.e., a hardware processor that runs a computer program that executes computer programs supplied to it, akin to a compiler that executes computer programs. To carry the analogy forward, a compiler executes programs written using computer programming or specification languages such as FORTRAN. The database processor executes computer programs using a specification language described below.

The database processor 203 when requested to execute a suitably specified computer program produces a computational object called a session, such as sessions 202-1 and 202-2 shown in FIG. 3. The database processor 203 may have any number of sessions operating at any given time within the distributed computing environment 200. A session may contain one or more virtual machines VMs. In the example of FIG. 3 the two sessions 202-1 and 202-2 contain several VMs 204.

A session also contains a data store in which the data is categorized into two lists, called TL (Token List) and PL (Program List). For instance, session 202-1 includes data store 201-1 and session 202-2 includes data store 201-2. Typically only one data store per session is created. Details of the operations performed by the database processor on data in the TL and PL lists are provided later.

In practice, in some embodiments the database processor may be implemented as a computer virtualization program in which the kernel of an operating system allows the creation and termination of one or more user spaces wherein one or more session objects may be created. The database processor creates one or more VMs in a session object that operate on the TL and PL lists in the data store in the session. Computer software virtualization is well-known in prior art.

Data from Sensor Devices

A user computing device is a device containing one or more processors with one or more network connections (fixed and/or wireless) and possibly one or more sensors that detect the state of the device or its environment. As previously mentioned, examples of user computing devices include smart phones, tablet computers, laptop/desktop computers, smart cars, smart household appliances, wearable computers, etc.

Referring to the illustrative example in FIG. 3, we note that the sensor 51 may produce data such as e.g., geographic location data, ambient temperature, user motion data, etc., that is received by the distributed computing environment 200 from the user device 100 and stored in data store 201.

A computer program operating on such sensor data may need to ensure that the data is being produced by a trusted sensor. To achieve a trust model, one implementation proceeds as follows.

We require that a sensor (internal or external) associated with a user computing device that is to provide data to a computer program must first be registered with the computer program.

Establishing a secure connection between two entities is well-known in prior art. For example, we may use the Diffie-Hellman (DH) method. The DH algorithm operates by constructing a secret that is shared by the two communicating parties. It works as follows.

Let the two parties be named as A and B. (We may assume the A and B to be computer programs.) A and B agree on two prime numbers, “g” and “p”. Next, A generates a secret number, say “a”, and B generates a secret number “b”. “A” computes:

g ^(a)(mod p)=x

and B computes:

g ^(b)(mod p)=y

A and B exchange the computed numbers “x” and “y”. “A” discovers that the number, “y”, he receives from “B” is equal to the number he had generated, viz., “x”. Similarly, B discovers that the number he receives, “x”, from A is equal to the number, “y”, he had generated. The mutually agreeing discovery is based on the mathematical property of exponentiation and commutativity of integer multiplication:

(g ^(a)mod p)^(b)(mod p)=g ^(ab)(mod p)

(g ^(b)mod p)^(a)(mod p)=g ^(ba)(mod p)

FIG. 4A shows two computer programs named Alice and Bob using the conventional DH protocol/method to secure an open channel. We briefly describe the DH protocol to familiarize the reader with the notion of protocols.

In step 1, both Alice and Bob agree on the integers “g” and “p” and in step 2, a secure channel is set up between them using the standard DH algorithm. In step 3, Alice chooses a random integer “a”, computes (g^(a) mod p) and sends the result to Bob in step 4. Bob chooses a random integer “b” in step 5, computes (g^(b) mod p) and sends the result to Alice in step 6. In steps 7 a and 7 b, both Alice and Bob compute K=(g^(ab) mod p) as indicated. In step 8 both agree to use the computed “K” as an encryption key for future messages exchanged between them.

Use of the DH protocol assures programs Alice and Bob that they may securely exchange messages between themselves over an open public channel if they use the computed key “K”. That is, Alice wishing to send a message “m1” to Bob, encrypts it using a function encrypt(m1, K)=m2. Bob, upon receiving “m2”, may decrypt it using a function decrypt(m2, K)=m1.

Whereas the DH algorithm for secure communications between two parties is well-known, it may also be extended for three or more parties. However, such extensions may involve extra exponentiation/encryption steps to be carried out by the participating parties. In some cases, we may also need multiple messages to be broadcast between all the communicating entities. Since, exponentiation is an expensive process, and we may have many sensor devices associated with a user device, such extensions to DH may become prohibitively expensive. Also, hardware capable of doing exponentiation operations (or do them quickly) may not be available in sensor devices. Thus, when considering the use of DH in channels with multiple sensor devices, we may wish to use less computationally expensive methods.

It is known that the DH algorithm has vulnerabilities in certain situations. (Techniques are also known that may be used to mitigate these vulnerabilities.) However, our method of associating sensor devices with a first party that has established a secure channel with a second party does not depend on using the DH algorithm to set up the secure channel; any algorithm that establishes a secure channel between two parties may be used.

Thus, our description of the DH algorithm above is purely pedagogical and serves as an enabling example. Any method that establishes a secure channel between two parties may be used in conjunction with our method.

We now present our method and note that it is light weight and allows associating multiple sensor devices with a user computing device. That is, we consider channels in which sensor devices (s1, s2, s3, etc.) may be associated with a user computing device “ud” that, in turn, has a secure connection to a computer program “A” operating on data stored in database “db”. We may depict this situation as follows.

[s1, s2, s3, . . . ] - - - ud - - - db - - - A

Our approach may be generally described as the following sequence of steps (FIG. 4B). The illustration shows a single sensor device registered with a computer program. In practice, several sensor devices may be registered with a single computer program. A sensor device may also be registered with more than one computer program.

1. Establish a session between the “ud”, the “db” and the computer program “A”.

2. Establish a secure connection between “ud” and “db” using a suitable algorithm. In one embodiment, we use the DH algorithm to establish the secure connection, thus the “ud” and “db” agree on an encryption function, say K (based on the shared secret), the prime base “g” and modulus “p”.

3. The program “A” requests the sensor device to register itself and issues a registration identifier to the sensor device. The latter provides a hashed version of the identifier to the user device. Note that the function used herein is different than the agreed upon hash function in step 2 above.

4. The sensor device sends sensor data to “db” that causes it to be stored.

5. “A” requests sensor data from “db” and is re-directed to “ud” along with certain parameters.

6. “A” requests and receives authorization from “ud” based on the parameters from step 5 and its previously issued identifier (that is only known to “A” and sensor device, “s1”).

7. Upon being authorized, “A” accesses data from “db”.

8. The session established in step 1 above is cleared.

We now provide a fuller description of the above process with reference to FIG. 5A.

In steps 1 a, we establish a session between the user device, a first computer program (which in some embodiments may be the database processor referred to herein), and a second computer program. In step 1 b, the user device and the first computer program agree on “g” (prime base) and “p” (prime modulus).

In step 2, we establish a secure channel between the user device and the first computer program. Either DH or some suitable algorithm may be used. We assume the use of DH for illustrative purposes.

In step 3, the sensor device is initialized, i.e., its software logic is triggered or launched, and in step 4 a, the second program issues a registration request to the sensor device. We may assume that the second computer program needs the sensor data. The request is sent to the user device since the second computer program may not know the address of the sensor device. The user device forwards the request to the sensor device, along with the address of the second computer program.

In step 4 b, the sensor device requests the second computer program for an identifier and it is provided the identifier denoted “D” in step 5. It is also provided with the name of an encryption function, say H, (or the executable code of the encryption function). (For example, the sensor device may have been pre-provisioned with one or more encryption functions by its manufacturer). In step 6 a, the sensor device hashes “D” using function “H” and sends the result to the user device. Note that the user device is unaware of “D”, it only receives H(D). It is required that the encryption function “H” be different from the encryption function “K” from step 2.

In step 6 b, the user device computes ĝH(D) (“̂” denotes the exponentiation operation) and sends the result to the database processor. In step 7, the sensor device starts to generate sensor data and sends it to the database processor who causes it to be stored for later retrieval by other computer programs.

Anticipating that one or more computer programs may request access to the sensor data and that it will use the user device to authorize the requests of such computer programs, the database processor generates an authentication identifier, A, and sends it to the user device (steps 8A and 8B, cf. FIG. 5B).

The user device now performs the series of computations shown in step 9 (FIG. 5B). The goal of these steps is twofold. First, we wish to incorporate the sensor device identifier and the authentication identifier into a secret. This will allow the user device to verify the sensor device when requested by the database processor.

Second, incorporating the authentication identifier into a secret will allow the user device to verify the sensor device to a second computer program (different than the database processor) when requested (as shown below).

The computation shown in step 9 (cf. FIG. 5B) results in the derivation of 3 parameters T, U and V that are associated with the authentication identifier produced by the database processor and the identifier “D” assigned to the sensor device. (Note, that all identifiers are required to be integers so that we may perform the stated computations.)

In step 10, the user device sends the parameters T, U and V to the database processor for storage. It is to be noted that the database processor and the user device have previously agreed upon the prime base “g” when setting up the DH secure channel, and that it is computationally hard for an entity, e.g., the computer program shown in FIG. 5B, that does not know “g” to derive the parameters T, U and V. Note also that the authentication identifier “A” provided by the database processor to the user device is needed for computing the parameters.

Having set up the channel and stored the various derived parameters, we now consider the case wherein a second computer program requests access to the sensor data (step 11, FIG. 5C). The database processor, by one of the tenets of the present invention, needs permission from the user device. Contemporaneously, the second computer program wishes to be ensured that the sensor device is authorized to provide the requested information.

To achieve these two goals, the computer program is re-directed (step 12A) to seek permission from the user device. The re-direction instruction is overloaded by providing it the parameters A, T, U and V previously associated with the sensor device and stored in the database by the user device, as shown in FIG. 5B.

In step 12B, the second computer program sends the identifier “D” (only known to the second computer program and the sensor device) and the parameters A, T, U and V to the user device. The latter (steps 13C and 13D) uses U and V and the prime base (known only to it and the database processor) to derive Z (as shown) and compares it to the value of T (received from the second computer program). (Note that Z depends on knowledge of U and V that in turn depend on knowing U, V, A, etc.) A successful match assures the user device that the A, T, U and V parameters were provided to the second computer program by the database processor. (Recall that it is computationally hard for a computer program to generate T, U and V without knowing “g” and the encryption key K.)

Furthermore, the user device computes H(D) in step 13A and in step 13B compares it to the hashed value of “D” it received from the sensor device in step 6 a. A successful match indicates that the second computer program provided the identifier to the sensor device.

In step 14, the user device marks the identifier “D” as having been authenticated and sends it to the database processor who may in step 15 allow access to the second computer program. The second computer program may now, in step 16, use the authorization provided by the database processor to issue a data access request to the database processor.

Once data access is complete, the session established in step 1 a may be cleared (step 17).

Illustrative Embodiment Involving Sensor Devices

As a practical example of the use of the above method, consider a person who owns a smart car (e.g., a self-driving vehicle) that comes equipped with a key fob that allow the person to control various functions of the car, e.g., unlock the car, summon the car to a location where the owner is waiting, etc.

We assume the following correspondences using some of the terms from the descriptions provided above.

1. The key fob of a car corresponds to the sensor device.

2. The owner's smart phone corresponds to the user computing device.

3. A computer program running in a computer environment is to be referred to as a “first computer program”.

4. An application program running on one or more processors inside the smart car is to be referred to as the second program.

As another example of a sensor device (different from a key fob), a smart car may have an installed device to manage payment to toll booths, i.e., the toll paying device is triggered by equipment in a toll lane and the device interacts with the equipment to make a payment based on a pre-provisioned bank/credit card account. That is, in this case we may have two sensor devices (i) the toll paying device installed in the car, and (ii) the key fob which is carried by the owner/driver. As explained above, the two sensor devices may establish independent registrations with the second computer program, i.e., the program running in the car's processor(s).

Current toll paying devices, e.g., EZ-Pass in New York, are permanently linked to a user's bank account irrespective of who may be driving or controlling the car at any given moment. Using the inventions described herein, a suitably configured toll paying device may be preferentially installed in the car and tied to a user device carried by the driver. The user device then authorizes the toll paying device to use the bank account designated by the user/owner of the user device. Thus, if user John is driving the car and has his smart phone with him, the toll paying device charges John's account. If the same car were being driven by a different user, say Mary, who is carrying her smart phone then Mary's bank account would be charged for tolls. Thus, e.g., car manufacturer's may provide cars with pre-installed toll paying devices. Furthermore, car rental companies may utilize such cars since, in current practice, the rental companies are liable for toll payments since they “own” the toll paying devices, i.e., a toll paying device in the rental car is associated with the rental company's bank account or credit card.

The protocol described above associates the sensor device, e.g., the key fob or the toll paying device, with the user computing device. The user computing device, the first and second computer programs establish a session with a secure channel between the user device and the first computer program. The first computer program may be executed by, e.g., a car manufacturer's cloud computing environment, and the second computer program, e.g., may run on processors provided in the smart car. (In certain embodiments, the cloud computing environment may periodically provide—e.g., using a download operation—executable codes to one or more processors in the car so that no connection is needed to the cloud computing environment.) The second program needs data from the sensor device to provide services to the driver/owner. In some cases, the second program may need to ascertain that the key fob is within a certain distance of the car. In other cases, the second program may need to ensure that the key fob is authorized, e.g., is the key fob authorized by the user device to make a toll payment?

The key fob may be used to launch various services by the owner/driver without being present in the car. For example, a command issued from the key fob may cause the car to be driven to a designated location, or to heat the car's interior to a certain temperature, etc.

It is important to note that the owner/driver's information is not stored in the second program that runs in the car's processor(s). The second program may read the data stored by the first program and use the data. (This aspect is explained further in later descriptions.) At the end of the execution of the second program, the memory of the processor executing the latter program is cleared. At the end of the owner/driver session, session data is also cleared as will be explained below.

Thus, the car's equipment only has access to the user's data whilst its processors are executing services for the user and these processors do not retain the user's data after their execution.

A Note on Encryption Keys

In addition to the encryption key agreed upon by the database processor and the user computing device as per the description above, we assume that the user device is provisioned with one or more additional encryption/decryption keys. In examples provided later, we will have occasion to discuss the need to encrypt or decrypt data. To that purpose, such programs are required to seek the relevant keys from the user device that, in turn, may provide the keys using an internal policy, e.g., choose to provide a key at random from the list of provisioned keys, or choose to provide a key that has not been used for some pre-determined amount of time, etc.

Database Processor and Virtual Machines

Having handled sensor data, we now turn to describe the handling of user provided information. For instance, in the example in which the online service provider is an online bookstore, the user provided information will include a shipping address, payment account number, etc. To this purpose, we need to describe further the details of the database processor, i.e., the sessions, VMs and the executable computer codes (e.g., computer programs) that it creates and manages.

One or more service providers create computer programs or apps using a specification language described later which are stored in a directory. In one embodiment, the directory is an internal component of the distributed computing environment 200, FIG. 3. In other embodiments, the directory may be implemented as a standalone system. In one embodiment, the directory contains addresses of online locations (servers, websites, etc.) from which the computer programs may be accessed. Thus, the directory may contain a searchable list of computer programs.

Exemplary computer programs may perform actions of a “Book Seller” or “Payment Processor”, “Shipper”, etc. Other exemplary service providers may provide programs that enable “smart car services” or “medical services”, etc. FIG. 6 shows a few exemplary entries in the proposed directory of programs.

The column titled “Program Name Matching” represents the name of a computer program. The column title “Overall Service Description” represents a general phrase describing the service provided by the named program. The “User Info List” column provides a list of all the user data attributes that will be required from the user for the provisioning of the service if it is requested. It should be noted that proper subsets of these user data attributes are to be provided to the different computer programs that are required to deliver the service to the user. That is, none of the individual programs, including the program provided by the online service provider from whom the user initially requests the service (e.g., the bookseller), is to receive all of the user data attributes included in the “user info list” of FIG. 6. The latter is further discussed below.

It is envisioned that the directory is organized as to enable online searching by the database processor. For example, the column “Program Name Matching” may be organized as a searchable data structure, enabling the database processor to efficiently search and verify the existence of an entry, i.e., a computer program, in the directory. The column labeled “Name & Address of Supplier” is meant to describe the name of the supplier and its online locations, e.g., IP addresses, website addresses, etc., from whom the named computer programs may be obtained. It is envisioned that users may search the directory to find computer programs, e.g., by names of suppliers.

Searching and discovering programs in the directory further implies that a user may state searchable attributes, e.g., find a program enabling buying books. For example, assume a program named “Book” in the directory. It may have associated search attributes such as “buying a book”, “cheap books”, etc. The column “Search Attributes” in the table of FIG. 6 is intended to convey this notion.

We will also have occasion for computer programs to find “matching” names or other identifiers of computer programs in the directory, e.g., given a name of a program, N, find a computer program in the directory whose name matches the name “N”. Thus, we assume that the directory contains entries that contain names or other identifiers of computer programs. The column “Program Name Matching” in FIG. 6 is intended to convey this notion.

In practice, all the various kinds of search mechanisms described above may be combined using Boolean connectives such as AND, OR and NOT. Thus, e.g., find a program with name N, supplied by supplier-3, with attributes “buying books”, etc.

A user may search the directory, find a program and may download the program to his user computing device. When seeking service from a service provider, a user may ask the database processor to initiate a session and inject the discovered program into the PL list of the data store of the session (FIG. 3). Alternatively, the user may take actions or issue commands when searching the directory that cause the database processor to create a session and inject the discovered computer program into the PL list of that session. We use the phrase “user device causes the injection of a computer program” to denote either of these embodiments.

To obtain a service or product or otherwise perform any online transaction, a user device issues a request to the database processor. The request causes the database processor to initiate a session, create one or more virtual machines, say VM1, VM2, etc., and initialize the TL and PL lists in the data store in the session (FIG. 3). Note that initially the TL and PL lists are empty. The user device causes a name of a discovered program to be injected into the list PL.

The database processor is further configured to begin monitoring the list PL for names of programs as described later. If a name is found in the list PL, the database attempts to find one or more computer programs in the directory whose names match the name inserted into the PL list.

Since the database processor is monitoring the PL list, it may find one or more computer programs in the directory whose names match the name that was caused to be injected by the user device.

The database processor fetches the one or more matching programs in the directory and inserts each such program into one virtual machine in the session and requests each virtual machine to execute the injected program. As the injected programs begin execution in VM1, VM2, they may produce output. As will be shown later, the output of such programs is generally constrained to be of two forms: tokens that contain encrypted data and the names or other identifiers of computer programs. The names or other identifiers are in the clear.

The database processor is configured to store the (encrypted) tokens that may be outputted by a program executing in a VM into the TL list of that session. Any names of programs outputted by an executing program in a VM are stored in the PL list of that session.

We may thus state a monitoring condition that specifies operation of the database processor:

[Monitoring Condition, MC]: The database processor searches the PL list in each session for the names of computer programs and finds computer programs in the directory whose names match the name(s) in the PL list. For example, consider a computer program in the directory whose name is “P”, i.e.,

Program: Name=“P”

Now suppose PL contains the name “P”. The matching condition in this case would be satisfied.

When a program executing in a VM terminates its execution, the program and the VM in which it executes are both cleared. When all VMs in a session have been cleared, the session is terminated.

The above process of monitoring the program list, creating sessions and VMs in which programs run and produce outputs that populate PL and TL, etc., continues until no new matches can be found using the MC condition. We may encapsulate the above described process by the following method denoted Method RM:

1. Receive a user request. Create a session and its data store containing the lists PL and TL.

2. User causes the name of a program to be injected in PL.

3. The database processor runs the monitoring process using the condition MC.

4. If successful matches are found, the matched computer programs are fetched from the directory, each program is inserted into a VM that is created for this purpose and the VM is configured to execute the inserted program. The programs may operate on the data in the TL list. Their outputs may comprise names of programs that are inserted into the PL list, or tokens that are inserted into the TL list.

5. A name in the PL list that has been matched against the contents of the directory is removed from the PL list so that duplicate matches do not occur.

6. If a program executing in a VM finished execution, the VM is cleared.

7. Repeat steps 4, 5 and 6 until the PL list becomes empty.

8. Clear the session.

Thus, the above operations of the database processor for a single session may be depicted as shown in FIG. 7. The session object 202 contains a VM 204 executing a program 205 operating on and storing tokens in TL 41, and outputting program names to PL 31. The database processor 203 has access to a directory server 500. Note that the directory server 500 may also be accessed by user computing devices desirous of searching or discovering computer programs as described above. The database processor 203 is configured to operate according to method RM as described above.

It remains to describe the computer programs executed in VMs created by the database processor. We first describe an exemplary case.

Consider the three computer programs named Book, Payment and Shipment of FIG. 8A.

The program “Book” comprises instructions that are mostly self-explanatory. Thus, “Display Book List to user” is interpreted to mean that when the computer program executes the indicated instruction, a list of books is displayed on the user device. Note that the data in the list is assumed to be provided, a priori, to the computer program, e.g., the program may be initially provisioned with such a list. (The specification of the user device will be “bound” at run-time—the binding of variables in computer instructions to specific entities is well-known in prior art.) As another example, the instruction “Ask user for title of book” seeks input from user device. Such information is provided by the user at run-time.

The instruction “Get user device location” is an instruction to execute a procedure akin to the one described earlier by means of which sensor data from a user device is accessed.

The instruction “Token: location” bears further description. The instruction is meant to indicate the encapsulation of the data “location” into an encrypted form that is outputted to TL 41 (FIG. 7). Generally, token instructions contain a list of data elements that are to be encrypted and then outputted to the list 41. The encryption key is to be obtained from the user device that initiates the session in which the program is executing, e.g., by using the instruction “get” as a subroutine.

The instruction “Output: Payment” is similar to the token instruction above, except that the name “Payment” is not encrypted.

The program labeled “Payment” in FIG. 8A contains the instruction “Input: title, location” that conveys the instruction to read tokens “title” and “location” from the token list 41 (FIG. 7) and, since the indicated elements are encrypted as per above, to decrypt the indicated elements using a key obtained from the user device again, e.g., using the “get” instruction as a subroutine). Note that program “Payment” creates tokens for “amount” and “pay” that are stored in encrypted form in list 41 (FIG. 7). Furthermore, whereas the program acquires the data “user name” from the user device, it does not create a token for it. This is a design feature of the program specification language described herein, i.e., data acquired or computed by a program may not be, optionally, outputted.

The instructions of program “Shipment” may be similarly described. It is to be noted that “Shipment” does not create any tokens and does not have any “Output” instructions.

FIG. 8B summarizes the new kinds of instructions shown in the exemplary program of FIG. 8A along with their semantics.

Given the exemplary descriptions above of the computer programs, a specification language for computer programs suitable for the purposes of this invention may be taught. The language in question consists of programming instructions similar to most conventional programming languages with the exception of the new instructions “token”, “display”, “get”, “ask”, “output” and “input” whose general operations have been described above and which may be implemented using conventional means of subroutines, encryption and decryption.

The instructions “get” and “ask” that obtain information from user devices have an additional functionality as follows.

The execution of both instructions is monitored by the database processor. Such monitoring may be enabled, e.g., by ensuring that both instructions, when attempting to access a user device, are configured to first access the database processor and the latter accesses the user computing device. That is, the database processor mediates the access requests from “get” and “ask” to the user device.

The monitoring of the “get” and “ask” instructions is further configured to ensure the following two conditions.

1. The informational attributes asked of the user device by “get” and “ask” instructions are contained within the specified “User Info List” associated with the service (cf. FIG. 5).

2. No single computer program may ask and obtain ALL of the informational attributes from the user device.

The above two conditions compel service providers to provide services that utilize more than one computer program and limit the totality of information that a single computer program may receive from a user device. The above two conditions, along with the actions of encrypting the identifiers in the token list and the termination and clearing of the VMs and the session object constitute the trust model provided by the database processor to the user community.

The database processor operates in a manner as to preserve the trust model. In this sense, the latter represents a contract between the user community and the database processor, i.e., the trust model specifies the meaning of the phrase “user data privacy”, the contract being enforced by the database processor.

The operation of the database processor may now be further described in FIG. 9 and as follows with respect to the programs shown in FIG. 8A.

The user device issues a request to the database processor that establishes a session and begins monitoring the PL and TL lists. The user device injects the program named “Book” in the program list. The database processor monitors the program list PL, attempting to find matching entries in the directory. When it finds a successful match, i.e., condition MC is satisfied, it executes method RM.

Execution of method RM causes the creation of a VM in which the program named “Book” begins execution. The output of the program, namely the tokens “location” and “title of book” are stored in TL in encrypted form, and the string “Payment” (in the clear) is stored in the PL.

The program “Book” terminates and the database processor terminates the VM. The monitoring process continues since the PL list is not empty, i.e., it contains the name “Payment”. The monitoring now finds a match between the directory entries and the name “Payment” in PL.

The database processor, since it has found MC to be satisfied, creates a second VM in which the program named “Payment” begins execution, producing tokens “amount” and “pay” (in encrypted form) in TL and the clear string “Shipment” in PL. After the program “Payment” concludes, its VM is terminated.

Since PL is still non-empty, the monitoring by the database processor continues and finds a successful satisfaction of MC, whereby a VM is created to execute the program named “Shipment” operating on tokens “amount” and “pay”. This VM is also terminated when “Shipment” concludes its execution. No names of programs are outputted by the program “Shipment”. Thus, the list PL becomes empty and no more matches are found. The database processor may terminate and clear the session.

Technical Explanation of the Database Processor

A technical explanation may be provided of the working of the database processor. To receive service provisioning from a service provider, a user device injects a computer program into a computational environment where the computer program may execute. The running of the computer program is controlled in the manner in which it asks for user data or produces output, e.g., the output of the computer programs is constrained to be either tokens written to the token list or names or other identifiers of computer programs written to the PL list.

Furthermore, the computer program rewrites itself, in the sense of a Post Rewriting System [cf. Emil Post (1947), Recursive Unsolvability of a Problem of Thue, The Journal of Symbolic Logic, vol. 12 (1947) pp. 1-11. Reprinted in Martin Davis ed. (1965), The Undecidable: Basic Papers on Undecidable Propositions, Unsolvable Problems and Computable Functions, Raven Press, New York, pp. 239ff]. That is, a computer program S rewrites itself as computer program T given the data contexts “u” and “v”, known as pre- and post-contexts, respectively. The notation

uSv→uTv

denotes the above notion.

An implementation of such a rewriting system thus retains no “memory”, since the state uTv may not be rewritten as uSv, i.e., the “arrow” may only be traversed from left-to-right and not in the backwards direction and that the pre- and post-contexts, i.e., the “u” and “v” remain unchanged in the left and right-hand sides of the above notation.

As will become clear momentarily, we will associate data elements in the TL list (41, cf. 7) with the pre- and post-contexts, i.e., the “u” and “v” in the above notation. We will associate computer programs denoted by the upper-case letters such as “S” and “T”, etc., with names of programs in the program list PL (31, cf. FIG. 7). Thus, the notation “uSv→uTv” may be interpreted as “if the program S operating on input “u” produces output “v” then S may be rewritten as T (with the same input and output data contexts)”.

In the present invention, computer programs or apps, provided by e.g., service providers, are injected by a user device into a computational environment. The environment generates a session with virtual machines for executing the injected computer programs, with each computer program being executed in its own virtual machine. Assume an injected computer program, say S, is provided with input “u”. S executes, i.e., runs in the virtual machine, and produces output, i.e., token, “v” and the name of a program, T. The output (and input) elements are associated with the session and not the virtual machines in the session.

The session, at this juncture, contains the data “u”, the data “v”, and the program S. The computational environment terminates and clears the program S and its associated virtual machine and accesses the directory to get a program, say T, which is injected into the session. The session now contains the program T and the contexts “u” and “v”. We may thus represent the above operation of the computational environment by saying that the computational environment rewrites S as T using the rule “uSv→uTv”. Given the exemplary programs shown in FIG. 8A, we may describe the working of the database processor as the rewriting implicit in the following pair of Post rewriting rules. Note that “<>” denotes the empty context.

  <>Book<title><location> →  <>Payment<title><location> <pay><amount>Payment<> →  <pay><amount>Shipment<> wherein the database processor is provided a suitable directory containing programs Book, Payment, and Shipment. FIG. 9 shows a pictorial rendition of the rewriting process by the labels R1 and R2. Additionally, FIG. 9 shows lists TL 41 and PL 31 containing the indicated contextual elements.

The preceding paragraphs have described a process R1 (FIG. 9) in which a first VM, VM1, is created for the execution of program named Book. The output produced by this program is used by the database processor as matching criteria to locate a second program “Payment.” The database processor then creates a second VM2, causing the execution of the program “Payment” in VM2. The causality relationship between the programs “Book” and “Payment” is referred to as a rewriting operation encapsulated in the above descriptions as represented by a rewrite rule R1 of Post logic.

Similarly, the operation R2 denotes the rewriting of program Amount as program Shipment and the rewriting is shown as label R2.

It is to be noted that the rewriting operation is not explicitly described or contained in any component of the database processor. It is implicit in the operation of the database processor, i.e., it is a side-effect of the monitoring condition and the method RM by which the database processor operates.

Thus, condition MC and method RM executed by the database processor serve to describe, implicitly, the operation of program rewriting. Such implicit working of the rewriting process is by design. Since the rewriting process is never declared explicitly, it is never available for access by third parties, and hence it may not be used to discern the information that links different data elements together.

Illustrative Embodiment

We now provide descriptions of an illustrative embodiment of the present invention (cf. FIG. 10).

Various sensor devices 10 (FIG. 10) may be located in an environment also containing a user device 100 that may contain one or more (internal) sensor devices 11. The devices 10 may be in association with the user device 100 by means of link 3. Alternatively, they may be aggregated via link 5 to a server 30 that is associated with the user device 100 via link 105. The user device 100 is connected to the distributed computing environment 200 via link 95. It may also have access to the directory server. The database processor program described above (203, cf. FIG. 3) runs in the environment 200.

The environment 200 is also linked to a directory server 500 and an application server 600. The latter may also be optionally connected to the directory server.

The database processor creates session objects and VMs, etc., as described above. These are not shown in FIG. 10 since they have been described above and shown in FIG. 3.

We consider an application which enables the user to buy a book online, pay for it and arrange its shipping. The entire process appears as an end-to-end or unitary transaction to the user, though it may be carried out by multiple interacting entities, i.e., computer programs supplied by various providers. The user utilizes his user device and provides information, e.g., title of book, payment, etc., as needed. Some information, e.g., location, may be gleaned from sensors in his device. All information is provided to a database processor operating in a manner as to preserve the user's information in the sense that the individual components of the unitary transaction may not be linked to derive an overall knowledge about the user. Furthermore, the individual components of the unitary transaction that receive user information are computational entities that are created and cease to exist to carry out a computation and then cease to exist.

Service providers using application servers create computer programs offering various services to users of user computing devices and smart devices. Smart devices generally refer to devices containing one or more processors, one or more network interfaces and one or more sensors to sense environmental indicia from their surroundings. Examples of smart devices include smart appliances, smart vehicles, and so on. A directory server is populated with the computer programs so created and offered to consumers. A consumer using a user computing device, e.g., a smart phone, browses or searches a directory server 500 and discovers a program enabling it to buy books online. (For example, the program may be advertised as preserving user data privacy.) The user device downloads and launches the program, perhaps later.

FIG. 11A depicts the situation wherein the user device has selected a computer program. It issues a request (step 1 a) to the database processor to establish a session (step 1 b) and causes the selected program's name, Book, to be stored in PL (step 1 c). In step 1 d, the database processor fetches the computer program “Book” from the directory. As described above, this causes the database processor to create a virtual machine VM100 (step 2) that executes the logic of program “Book” (step 3). The execution results in a list of books being displayed and the user supplying the title of a (selected) book to the program (steps 4 a and 4 b). The program also obtains the location of the user device from the device's sensor in step 5. (The details of this acquisition process have been described above.)

Next, in step 6 a, the program asks for encryption keys from the user device and, in step 6 b, creates tokens for the data elements “title” and “location”. The tokens are stored in TL. In step 6 c, the program outputs “Payment” to PL. Program “Book” ends its execution, thus VM100 is terminated.

In step 8 a (FIG. 11B), the database processor finds “Payment” in PL and, in step 8 b, fetches the program “Payment” from the directory. In step 9, it creates a virtual machine VM200. In step 10 a, the program begins execution and in step 10 b reads tokens “title” and “location” from TL. In step 10 c, it requests decryption keys from the user device to decrypt the tokens “title” and “location”. Step 11 leads to the acquisition of payment information from the user and its processing in step 12. In step 13 a, the program fetches decryption keys from the user device and in step 13 b creates tokens “Pay” and “Amount” and stores them in TL. In step 13 c, the program outputs “Shipment” to PL.

The program now terminates execution, causing VM200 to be terminated.

FIG. 11C similarly describes the execution of program “Shipment” in virtual machine VM300 at the conclusion of which no output is provided to PL.

It is important to note step 19 a “Arrange shipping (OOB)” wherein the program “Shipment” communicates the address of the user to the shipper. The abbreviation OOB (Out-of-band) stands for a communication that is considered to be “special” in the sense that it communicates user data to an external entity.

The database processor flags all communications in which data obtained from a user device is communicated to an external entity. The database processor may then follow up a flagged (OOB) communication with an alert to the user device. Step 19 b shows the alert to the user device generate by the database processor. That is, the database processor generates an alert message to the user device whenever it detects an output in the clear relating to a user provided informational element.

Continuing with FIG. 11C, since no output to PL is produced by “Shipment”, the PL list becomes empty. Furthermore, Shipment concludes its execution. Thus, VM300 may be terminated and the monitoring process does not find any new matches. Thus, the session may be cleared. In this sense the data elements, i.e., contents of the lists PL and TL are ephemeral.

We have thus illustrated that user information provided during the provisioning of the overall service to the user does not result in any of his information being retained in the system. This implies, for instance by referring to FIG. 2, that the linking of user information from different components of an overall service provisioning infrastructure is not possible in the invention described herein.

Skilled readers will understand that many variations of the above decentralization of the user experience are possible in which various service providers may provide components of an overall service.

An aspect of note is that the programs run in the database processor in virtual machine environments, write encrypted information into the respective lists in the data store using encryption keys from the user device. Thus, no other process can read the data in the lists and construct an integrated user profile. Moreover, as the programs terminate, no state information is left in the data store.

It is, of course, possible for a service provider to retain certain information acquired because of the user receiving an overall service. For example, the Shipper may record the address to which a shipment was delivered. But the name of the consumer is not known to the shipper.

Thus, the use of an out-of-band communicating process may reveal fragments of user data to one or more service providers. The present invention envisions that such out-of-band communications are highlighted by the database processor to the user. Thus, the user is made aware of the possible revelation of fragments of his data to a service provider.

Whereas the above embodiment has assumed that the overall service (e.g., buying a book online) is effectuated by multiple interacting entities, in other embodiments a single provider may provide all the components of the service (for example, by providing all the necessary computer programs). This does not limit the present invention since the execution of the computer programs uses a system that preserves user data privacy as described above.

In this respect, it is appropriate to mention, and the invention described herein envisions, the use of block-chain systems to implement services as smart contracts provided by multiple entities. A smart contract may be visualized, in abstract terms, as a computer program of a certain form, operating on data stored in the ledger(s) of the block-chain system. That is, the ledgers are akin to the data store and the smart programs are akin to the computer programs described herein. In this sense, the rewriting process that underpins the operation of the database processor may be viewed as providing a component of the operating system for smart contracts.

Skilled practitioners would have noticed that the exemplary descriptions of the database processor posit a non-determinism in its operations. That is, the list PL may contain multiple names of programs or a name in PL may match multiple program names in the directory.

The inventions described herein envision overloading the “Output” program instruction described above as follows. We may use the Output statement not only to specify names of programs but we may additional attributes such as names of suppliers and various program attributes that narrow the searching of the directory.

Other Illustrative Embodiments

While the present exposition has concentrated on the Seller-Shipper-Payment service experience, many other examples of service experiences exist that may benefit from the inventions described herein. For example, autonomous vehicles such as smart cars are expected to contain many internal sensor devices that will report various kinds of data. The present invention envisions that users of such cars can derive benefits from the techniques described herein wherein sensor data from cars trigger computer programs (provided by service providers); such programs may then use the system and methods described herein to offer services to such cars without imperiling the owner's data privacy.

As another example, user's physical activities may be monitored and analyzed by smart devices worn by a user or by devices that are near a user, e.g., installed in exercise machines. Activities may then be analyzed, rated and scored and the data from such analysis may be communicated to health care providers or insurance providers.

User Data Portability

In traditional telecommunication systems, it is common for consumers to own their telephone numbers. A consumer may retain his phone number when switching from one service provider to another. The change was necessitated by regulations and is known as local number portability.

It is possible to envision several reasons, including legislative, that may require a user to own his data and be able to switch providers, bringing his user data from the old to the new provider. Personal medical records provide a compelling example. A consumer may have his medical data stored on his user computing device, or in a private storage system accessible to service providers upon presenting requisite credentials that are only available from the user device. A consumer may then request medical services that access his medical data by recourse to his user device.

The term social graph is often used in social networking examples. The term refers to data comprising a user and his friends and followers. It may come to pass that portability of social graphs may be required or mandated. In such situations, a user can switch from one service provider to another, taking his social graph with him, in a sense described below.

Consider the current situation in online networks today wherein consumers trust certain service providers more than other service providers. For example, many consumers trust Google with their user name and password credentials. One assumption made by consumers supporting this behavior may be that Google's services are more secure and less likely to be penetrated by malicious parties. The evidence for this assumption is the facility supported by many service providers that allow consumers to access their accounts using Google credentials. Thus, a user may use his Google credentials to login into Twitter or Facebook, by way of example.

As a final example, the “winner take all” phenomenon on the Internet is known to create ever more powerful enterprises that offer many services. It may then be envisioned that they may, either voluntarily or under legislative requirement, be required to create a (business) unit or entity that handles user data and provides special handling or legislatively required guarantees. This implies that all the user data must then be under control of the unit and, hence, may be ported from one to another service provider.

We now describe how the subject matter described herein may be used to support user data portability. This can be accomplished by adding the following additional requirement to the descriptions provided above.

We extend the condition MC, described above, as follows. In addition to matching names contained in the list PL with names of programs in the directory, the user is allowed to state disqualifying matching criteria regarding one or more service providers. Thus, for example, the user may be allowed to state disqualifying criteria, e.g., “no programs from supplier-1 are to be chosen that match a name on the list PL” that modifies the condition MC and, hence, the behavior of the database processor.

Returning to the embodiment illustrated by FIGS. 11A, 11B and 11C, the modification to the MC condition may disqualify programs from a certain supplier to yield successful matches. Thus, the user device never receives any services from programs supplied by the disqualified provider.

Similarly, a supplier may be designated as to be selected by the MC condition.

The various embodiments described herein may offer a variety of advantages with respect to computing technology. Some of these advantages may include the following:

1. User computing devices may be freed from running computer programs, e.g., apps, thus conserving processing resources, power and so on. This may be particularly important in the case of mobile user computing devices such as smart phones where it is important to conserve battery power.

2. Apps may not need to be downloaded to user computer devices. Rather, when a user selects an app from the directory server (500, cf. FIG. 7), he may be provided an option to have the selected app injected into the database processor directly, without the intermediate downloading operation. This frees the user from managing apps on his user computing device. Thus, the user's handling and management of his device is simplified. This also implies that apps on user computing devices need not be updated periodically, thus saving networking bandwidth and capacity. Furthermore, app may be recommended to a user who may then act upon the recommendation without having to download the app to his device.

3. The directory server (FIG. 6) represents a re-architecture of app store technology. The latter is currently used by many service providers. By removing the download and updating functions currently provided by app store technology, we improve and simplify the technology and operation of app stores.

4. By extending the well-known DH algorithm and its look-alikes to securely handle data communications from multiple sensor devices via a single user computing device, we extend and simplify the reach and working of networking protocols to handle the newly emerging technologies of smart devices (such as autonomous cars, smart household appliances, etc.) that make extensive use of such sensor devices. Since DH (and its look-alikes) are used extensively in the industry, such an extension will improve the efficiency, operation and cost of networking protocols.

Certain Illustrative Commercial Embodiments

We provide a few commercial embodiments of the inventions described herein.

FIG. 12 shows an embodiment wherein a smart device 300, e.g., a smart car, a household refrigerator, or a smart door lock to a home, etc., is configured to provide services to consumers via wired/wireless connection 53. (The use of the term “smart” is intended to denote devices that contain one or more processors which may be configured with executable codes.) The smart device may obtain its executable codes from one or more computer programs 400, the obtaining being pre-provisioned, periodically provisioned, or provisioned on demand. The program 400 may also provision a device, key 100, with executable codes. Finally, a user device 200 may be provided with executable codes by the program 400. Again, such provisioning may be demand-driven or comprise a periodic out-of-band process.

As a commercial example, the key 100 and user device 200 are needed in conjunction for device 300 to provide services. Thus, a smart car 300 may provide programmed services only if the user device 200 and key 100 are used in conjunction since, as shown above, data from the key may not be accessible to the car 300 unless authorized by the user device 200. In this sense, the connections 51 and 52 (FIG. 12) depict the dependence of device 300 on devices 200 and 100, respectively, to provide its programmed services.

In this sense, the use of the key 100 and the user device 200 may be termed as akin to two-factor authorization of programmed services delivered by device 300 and, furthermore, the service is privacy preserving. The privacy of the data gathered by the key 100 and provided to the device 300 is guaranteed by the inventions described above.

Finally, it is an explicit consequence of the present invention that the association between the key 100 and the device 300 is controlled by the user device 200. That is, a different user device, say 500, may establish an association with key 100 and, if successful, invoke the services of device 300. Thus, it is the user device 200 that controls the association between the device 300 and key 100. This allows services provided by device 300 to be ported to different users.

FIGS. 13A and 13B show a different commercial embodiment. FIG. 13A provides an abstract view of service disaggregation compelled by the inventions described herein. A service provider, e.g., online seller of books, is engendered by the dictates of the present invention to disaggregate its service offering so that it is provided by more than one computer program, the more than one computer program interacting between themselves, and the user device being one of the interacting components.

That is, whereas FIG. 13A shows service provisioning 400 as a “black box” operation, FIG. 13B shows the service 400 being disaggregated into the components 401, 402 and 403. (The present invention dictates more than one component.) For example, an online book buying service 400 may be engendered to be disaggregated into components Book 401, Payment 402 and Shipment 403. Furthermore, the interactions between components 401, 402 and 403 must necessarily involve the user device 200.

Thus, the user device 200 becomes a component of the service provisioning process and not simply a device that requests and receives services. The user device, when acting as a component of service provisioning, provides and controls user data that is needed for service provisioning. In this sense, the user device becomes a control component of service provisioning.

FIG. 14 shows service portability across service providers wherein a user may port his service from a first provider to a second provider. Such porting is effectuated, as described above, by compelling the service to be disaggregated and then utilizing the user device to choose components that are not provided by the first service provider. This notion of portability of service is made possible because the user device controls the user's data and, hence, may cause the latter to be provided to selective service providers only.

Illustrative Computing Environment

Aspects of the subject matter described herein may be described in the general context of computer-executable instructions, such as program modules, being executed by a computer. Generally, program modules include routines, programs, objects, components, data structures, and so forth, which perform particular tasks or implement particular abstract data types. Aspects of the subject matter described herein may also be practiced in distributed computing environments where tasks are performed by remote processing devices that are linked through a communications network. In a distributed computing environment, program modules may be located in both local and remote computer storage media including memory storage devices.

Also, it is noted that some embodiments have been described as a process which is depicted as a flow diagram or block diagram. Although each may describe the operations as a sequential process, many of the operations can be performed in parallel or concurrently. In addition, the order of the operations may be rearranged. A process may have additional steps not included in the figure.

The claimed subject matter may be implemented as a method, apparatus, or article of manufacture using standard programming and/or engineering techniques to produce software, firmware, hardware, or any combination thereof to control a computer to implement the disclosed subject matter. For instance, the claimed subject matter may be implemented as a computer-readable storage medium embedded with a computer executable program, which encompasses a computer program accessible from any computer-readable storage device or storage media. For example, computer readable storage media can include but are not limited to magnetic storage devices (e.g., hard disk, floppy disk, magnetic strips . . . ), optical disks (e.g., compact disk (CD), digital versatile disk (DVD) . . . ), smart cards, and flash memory devices (e.g., card, stick, key drive . . . ). However, computer readable storage media do not include transitory forms of storage such as propagating signals, for example. Of course, those skilled in the art will recognize many modifications may be made to this configuration without departing from the scope or spirit of the claimed subject matter.

Moreover, as used in this application, the terms “component,” “module,” “engine,” “system,” “apparatus,” “interface,” or the like are generally intended to refer to a computer-related entity, either hardware, a combination of hardware and software, software, or software in execution. For example, a component may be, but is not limited to being, a process running on a processor, a processor, an object, an executable, a thread of execution, a program, and/or a computer. By way of illustration, both an application running on a controller and the controller can be a component. One or more components may reside within a process and/or thread of execution and a component may be localized on one computer and/or distributed between two or more computers.

The foregoing described embodiments depict different components contained within, or connected with, different other components. It is to be understood that such depicted architectures are merely exemplary, and that in fact many other architectures can be implemented which achieve the same functionality. In a conceptual sense, any arrangement of components to achieve the same functionality is effectively “associated” such that the desired functionality is achieved. Hence, any two components herein combined to achieve a particular functionality can be seen as “associated with” each other such that the desired functionality is achieved, irrespective of architectures or intermediary components. Likewise, any two components so associated can also be viewed as being “operably connected”, or “operably coupled”, to each other to achieve the desired functionality. 

1. A method for facilitating delivery of a product and/or service to a user, comprising: causing a first executable computer code to be inserted into a computing environment in which a user session is established, the first executable computer code being associated with an entity that provides the product and/or service; establishing a user session in the computing environment; in response to the first executable computer code being inserted into the user session, creating a first virtual machine in the user session; executing the first executable computer code in the first virtual machine, wherein executing the first executable computer code includes obtaining, over a communications network and from a user computing device of the user, a first proper subset of all information needed from the user computing device that is required to fulfill delivery of the product and/or service, the first proper subset of all the information being less than a complete set of all the information needed from the user computing device that is required to fulfill delivery of the product and/or service, the first proper subset of the information being processed by the first executable computer code, the first executable computer code producing first output data; terminating the first virtual machine upon completion of executing the first executable computer code; obtaining a second executable computer code based at least on a first portion of the first output data produced by the first executable computer code; causing the second executable computer code to be inserted into the user session established in the computing environment; in response to the second executable computer code being inserted into the user session, creating a second virtual machine in the user session; executing the second executable computer code in the second virtual machine, wherein executing the second executable computer code includes obtaining, over the communications network and from the user computing device, a second proper subset of all the information needed from the user computing device that is required to fulfill delivery of the product and/or service, the second proper subset of all the information being less than the complete set of all the information needed from the user computing device that is required to fulfill delivery of the product and/or service and including information not included in the first proper subset of the information, the second proper subset of the information being processed by the second executable computer code, the second executable computer code producing second output data; terminating the second virtual machine upon completion of executing the second executable computer code; and based at least in part on the second output data produced by the second executable computer code, causing the product and/or service to be delivered to the user of the user computing device.
 2. The method of claim 1, wherein executing the second executable computer code includes executing the second executable computer code using at least a second portion of the first output data produced by the second executable computer code.
 3. The method of claim 1, wherein the first portion of the first output data includes an identifier of the second executable computer code.
 4. The method of claim 3, wherein at least some of the first output data produced by the first executable computer code is encrypted with an encryption key associated with the user computing device, wherein executing the second computing device includes obtaining the encryption key to decrypt the output data encrypted by the first executable computer code.
 5. The method of claim 1, further comprising terminating the user session after causing the product and/or service to be delivered to the user of the user computing device.
 6. The method of claim 5, further comprising terminating the user session in response to user action.
 7. The method of claim 5, further comprising terminating the user session in response to action of the computing environment.
 8. The method of claim 5, wherein terminating the user session includes clearing memory of the user session from the computing environment.
 9. The method of claim 1, further comprising storing the first and second proper subsets of the information in a data store included in the user session.
 10. A method for performing a transaction over a communications network, comprising: responsive to a user request received over the communications network, establishing a user session in a computing environment; executing a plurality of executable computer codes that each perform a portion of the transaction, wherein executing each of the executable computer codes includes obtaining over a communications network and from a user computing device of the user, a different proper subset of all information needed from the user computing device that is required to complete the transaction, each of the proper subsets of all the information being less than a complete set of all the information needed from the user computing device that is required to complete the transaction, each of the executable computer codes processing the respective subset of information that it obtains; wherein information is only exchanged between and among the plurality of executable computer codes during execution of each of the executable computer codes by obtaining encrypted output information that was previously output from one of the executable computer codes, the encrypted output information being encrypted such that one or more decryption keys are required from the user in order to decrypt the output information; and after completing execution of a final one of the executable computer codes necessary to complete the transaction, terminating the user session so that each of the subsets of information no longer exist in the computing environment.
 11. The method of claim 10, wherein each of the executable computer codes is executed in a different virtual machine that is terminated after execution is completed and prior to executing a subsequent one of the executable computer codes.
 12. The method of claim 10, further comprising monitoring the plurality of executable computer codes to ensure that no individual one of the executable computer code obtains all of the information needed from the user computing device that is required to complete the transaction.
 13. The method of claim 12, further comprising alerting the user if any information provided by the user is communicated by any of the executable computer codes in the clear to another executable computer code. 